Two-dimensional systems with competing interactions: microphase formation under the effect of a disordered porous matrix

We have investigated the effect of a disordered porous matrix on the cluster microphase formation of a two dimensional system where particles interact via competing interactions. To this end we have performed extensive Monte Carlo simulations and have systematically varied the densities of the fluid and of the matrix as well as the interaction between the matrix particles and between the matrix and fluid particles. Our results provide evidence that the matrix does have a distinct effect on the microphase formation of the fluid particles: as long as the particles interact both among themselves as well as with the fluid particles via a simple hard sphere potential, they essentially reduce the available space, in which the fluid particles form a cluster microphase. On the other hand, if we turn on a long-range tail in the matrix-matrix and in the matrix-fluid interactions, the matrix particles become nucleation centers for the clusters formed by the fluid particles.Comment: 12 pages, 6 figure

Lane-formation vs. cluster-formation in two dimensional square-shoulder systems: A genetic algorithm approach

Introducing genetic algorithms as a reliable and efficient tool to find ordered equilibrium structures, we predict minimum energy configurations of the square shoulder system for different values of corona width $\lambda$. Varying systematically the pressure for different values of $\lambda$ we obtain complete sequences of minimum energy configurations which provide a deeper understanding of the system's strategies to arrange particles in an energetically optimized fashion, leading to the competing self-assembly scenarios of cluster-formation vs. lane-formation.Comment: 5 pages, 6 figure

Relationships between synoptic-scale transport and interannual variability of inorganic cations in surface snow at Summit, Greenland: 1992-1996

To fully utilize the long-term chemical records retrieved from central Greenland ice cores, specific relationships between atmospheric circulation and the variability of chemical species in the records need to be better understood. This research examines associations between the variability of surface snow inorganic cation chemistry at Summit, Greenland (collected during 1992–1996 summer field seasons) and changes in air mass transport pathways and source regions, as well as variations in aerosol source strength. Transport patterns and source regions are determined through 10-day isentropic backward air mass trajectories during a 1 month (late May to late June) common season over the 5 years. Changes in the extent of exposed continental surfaces in source regions are evaluated to estimate aerosol-associated calcium and magnesium ion source strength, while forest fire activity in the circumpolar north is investigated to estimate aerosol ammonium ion source strength. During the 1995 common season, 3 times more calcium and magnesium accumulated in the snowpack than the other study years. Also, an increasing trend of ammonium concentration was noted throughout the 5 years. Anomalous transport pathways and velocities were observed during 1995, which likely contributed to the high levels of calcium and magnesium. Increased forest fire activity in North America was concurrent with increased levels of ammonium and potassium, except for 1996, when ion levels were above average and forest fire activity was below average. Because of the ubiquitous nature of soluble ions, we conclude that it is very difficult to establish a quantitative link between the ion content of snow and firn at Summit and changes in aerosol source regions and source strength

Degree Sequences and the Existence of kk-Factors

We consider sufficient conditions for a degree sequence $\pi$ to be forcibly $k$-factor graphical. We note that previous work on degrees and factors has focused primarily on finding conditions for a degree sequence to be potentially $k$-factor graphical. We first give a theorem for $\pi$ to be forcibly 1-factor graphical and, more generally, forcibly graphical with deficiency at most $\beta\ge0$. These theorems are equal in strength to Chv\'atal's well-known hamiltonian theorem, i.e., the best monotone degree condition for hamiltonicity. We then give an equally strong theorem for $\pi$ to be forcibly 2-factor graphical. Unfortunately, the number of nonredundant conditions that must be checked increases significantly in moving from $k=1$ to $k=2$, and we conjecture that the number of nonredundant conditions in a best monotone theorem for a $k$-factor will increase superpolynomially in $k$. This suggests the desirability of finding a theorem for $\pi$ to be forcibly $k$-factor graphical whose algorithmic complexity grows more slowly. In the final section, we present such a theorem for any $k\ge2$, based on Tutte's well-known factor theorem. While this theorem is not best monotone, we show that it is nevertheless tight in a precise way, and give examples illustrating this tightness.Comment: 19 page

Computer Assembly of Cluster-Forming Amphiphilic Dendrimers

Recent theoretical studies have predicted a new clustering mechanism for soft matter particles that interact via a certain kind of purely repulsive, bounded potentials. At sufficiently high densities, clusters of overlapping particles are formed in the fluid, which upon further compression crystallize into cubic lattices with density-independent lattice constants. In this work we show that amphiphilic dendrimers are suitable colloids for the experimental realization of this phenomenon. Thereby, we pave the way for the synthesis of such macromolecules, which form the basis for a novel class of materials with unusual properties.Comment: 4 pages, 4 figures, 1 tabl

Graphs with the maximum or minimum number of 1-factors

AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular bipartite graphs have the maximum number of 1-factors over all graphs with the same degree sequence. We identify two families of graphs that have the maximum number of 1-factors over all graphs with the same number of vertices and edges: the almost regular graphs which are unions of complete regular bipartite graphs, and complete graphs with a matching removed. The first family is determined using the Alon and Friedland bound. For the second family, we show that a graph transformation which is known to increase network reliability also increases the number of 1-factors. In fact, more is true: this graph transformation increases the number of k-factors for all k≥1, and “in reverse” also shows that in general, threshold graphs have the fewest k-factors. We are then able to determine precisely which threshold graphs have the fewest 1-factors. We conjecture that the same graphs have the fewest k-factors for all k≥2 as well